Voting and Bribing in Single-Exponential Time
نویسندگان
چکیده
منابع مشابه
Voting and Bribing in Single-Exponential Time
We introduce a general problem about bribery in voting systems. In the R-Multi-Bribery problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate wins the manipulated election under the voting rule R. Voters assign prices for withdrawing their vote, for swapping the positions of two consecutive candidates in their preference order, and for perturbing their appro...
متن کاملBribing in second-price auctions
An IPV 2-bidder second-price auction is preceded by two rounds of bribing: prior to the auction each bidder can try to bribe his rival to depart from the auction, so that he (the briber) will become the sole participant and obtain the good for the reserve price. Bribes are offered sequentially according to an exogenously given order—there is a first mover and a second mover. I characterize the ...
متن کاملVoting and different ranking orders in DEA
Data Envelopment Analysis (DEA) technique now widely use for efficiency evaluation of a set of Decision Making Units (DMUs). As regards of the necessity for ranking efficient units different DEA models presented each of which has advantages and rank efficient units from special aspects. Note that all the existing ranking models have disadvantages, as well and there is not a model in which all t...
متن کاملBribing in first-price auctions
I study a symmetric first-price auction prior to which one designated player can offer his rival a bribe in exchange for the latter’s departure from the auction. I consider Essentially Prefect Bayesian Equilibria (EPBE) of this game in which the bribing function is weakly increasing (EPBE is a superclass of PBE). I prove that every continuous such equilibrium (i.e., a one in which the bribing f...
متن کاملinvestigation of single-user and multi-user detection methods in mc-cdma systems and comparison of their performances
در این پایان نامه به بررسی روش های آشکارسازی در سیستم های mc-cdma می پردازیم. با توجه به ماهیت آشکارسازی در این سیستم ها، تکنیک های آشکارسازی را می توان به دو دسته ی اصلی تقسیم نمود: آشکارسازی سیگنال ارسالی یک کاربر مطلوب بدون در نظر گرفتن اطلاعاتی در مورد سایر کاربران تداخل کننده که از آن ها به عنوان آشکارساز های تک کاربره یاد می شود و همچنین آشکارسازی سیگنال ارسالی همه ی کاربران فعال موجود در...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Economics and Computation
سال: 2020
ISSN: 2167-8375,2167-8383
DOI: 10.1145/3396855